Stable least squares MQ approximation by local thinning
نویسندگان
چکیده
In this note a local thinning of the data locations is proposed, in order to construct a least squares multiquadric approximant stable and close to the multiquadric interpolant
منابع مشابه
Optimal Pareto Parametric Analysis of Two Dimensional Steady-State Heat Conduction Problems by MLPG Method
Numerical solutions obtained by the Meshless Local Petrov-Galerkin (MLPG) method are presented for two dimensional steady-state heat conduction problems. The MLPG method is a truly meshless approach, and neither the nodal connectivity nor the background mesh is required for solving the initial-boundary-value problem. The penalty method is adopted to efficiently enforce the essential boundary co...
متن کاملA New Technique for Image Zooming Based on the Moving Least Squares
In this paper, a new method for gray-scale image and color zooming algorithm based on their local information is offered. In the proposed method, the unknown values of the new pixels on the image are computed by Moving Least Square (MLS) approximation based on both the quadratic spline and Gaussian-type weight functions. The numerical results showed that this method is more preferable to biline...
متن کاملCurve reconstruction from unorganized points
We present an algorithm to approximate a set of unorganized points with a simple curve without self-intersections. The moving least-squares method has a good ability to reduce a point cloud to a thin curve-like shape which is a near-best approximation of the point set. In this paper, an improved moving least-squares technique is suggested using Euclidean minimum spanning tree, region expansion ...
متن کاملFrom unordered point cloud to weighted B-Spline - a novel PCA-based method -
Digital applications such as CG, CAD and GIS are based on vectorial data since all the information about shape, size, topology etc. are provided in such kind of data representation rather than raster one. Turning raster images into vector ones is a key issue which has been addressed by a number of authors but still far to be exhaustively worked out. Especially in the case of 2D images represent...
متن کاملConvergence of discrete and penalized least squares spherical splines
We study the convergence of discrete and penalized least squares spherical splines in spaces with stable local bases. We derive a bound for error in the approximation of a sufficiently smooth function by the discrete and penalized least squares splines. The error bound for the discrete least squares splines is explicitly dependent on the mesh size of the underlying triangulation. The error boun...
متن کامل